New Ideas and Applications of Scatter Search and Path Relinking
نویسنده
چکیده
Practical elements of Scatter Search and Path Relinking are illustrated by seven recent applications. The computational outcomes, based on comparative tests involving real world and experimental benchmark problems, demonstrate that these methods provide useful alternatives to more established search procedures. The designs in these applications are straightforward, and can be readily adapted to other optimization problems of varied structures. ∗ Research partially supported by the Office of Naval Research Contract N00014-01-1-0917 in connection with the Hearin Center of Enterprise Science at the University of Mississippi. * Partially supported by the Ministerio de Ciencia y Tecnología of Spain (Ref.TIC2000-1750-C06-01)
منابع مشابه
Scatter Search and Path Relinking
–The evolutionary approach called scatter search, and its generalized form called path relinking, originated from strategies for creating composite decision rules and surrogate constraints. Recent studies demonstrate the practical advantages of these approaches for solving a diverse array of optimization problems from both classical and real world settings. Scatter search and path relinking con...
متن کاملPrinciples of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first proposed in the 1970s, based on formulations dating back to the 1960s for combining decision rules and problem constraints. In contrast to other evolutionary methods like genetic algorithms, scatter search is founded on the p...
متن کاملScatter Search and Path Relinking: Foundations and Advanced Designs
Scatter Search and its generalized form Path Relinking, are evolutionary methods that have been successfully applied to hard optimization problems. Unlike genetic algorithms, they operate on a small set of solutions and employ diversification strategies of the form proposed in Tabu Search, which give precedence to strategic learning based on adaptive memory, with limited recourse to randomizati...
متن کاملA Template for Scatter Search and Path Relinking
Scatter search and its generalized form called path relinking are evolutionary methods that have recently been shown to yield promising outcomes for solving combinatorial and nonlinear optimization problems. Based on formulations originally proposed in the 1960s for combining decision rules and problem constraints, these methods use strategies for combining solution vectors that have proved eff...
متن کاملFundamentals of Scatter Search and Path Relinking
The evolutionary approach called Scatter Search, and its generalized form called Path Relinking, have proved unusually effective for solving a diverse array of optimization problems from both classical and real world settings. Scatter Search and Path Relinking differ from other evolutionary procedures, such as genetic algorithms, by providing unifying principles for joining solutions based on g...
متن کامل